Geometry of the Minimal Solutions of a Linear Diophantine Equation
نویسندگان
چکیده
Let $a_1,\ldots,a_n$ and $b_1,\ldots,b_m$ be fixed positive integers, let ${\mathcal S}$ denote the set of all nonnegative integer solutions equation $x_1a_1+\cdots +x_na_n=y_1b_1+\cdots...
منابع مشابه
Short solutions for a linear Diophantine equation
It is known that finding the shortest solution for a linear Diophantine equation is a NP problem. In this paper we have devised a method, based upon the basis reduction algorithm, to obtain short solutions to a linear Diophantine equation. By this method we can obtain a short solution (not necessarily the shortest one) in a polynomial time. Numerical experiments show superiority to other method...
متن کاملLinear reachability problems and minimal solutions to linear Diophantine equation systems
The linear reachability problem for finite state transition systems is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using some known results on minimal solutions (in nonnegative integers) for linear Diophantine equation systems, we present new time complexity bounds for the pr...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn the Solutions to the Diophantine Equation
In this paper we are concerned with a question that has already been answered, involving Fibonacci-type sequences and their characteristic numbers. We are only interested in primitive sequences iconsecutive pairs of terms have no common factors) and for these sequences we ask: What numbers can be the characteristic of a sequence, and given such a number, how many sequences have it? Thoro [1] ha...
متن کاملThe Smallest Solutions to the Diophantine Equation
In this paper we discuss a method used to find the smallest nontrivial positive integer solutions to a1 + a 6 2 = b 6 1 + b 6 2 + b 6 3 + b 6 4 + b 6 5. The method, which is an improvement over a simple brute force approach, can be applied to search the solution to similar equations involving sixth, eighth and tenth powers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/21m1404417